Data Diversity: A Search For Direction
نویسنده
چکیده
A method for enhancing the reliability of N-version software is proposed. A pilot study presents experimental results on data diversity, in which retry with a mutation-directed variation in input is attempted after system failure. These results suggest that mutation analysis could be valuable in the design of fault-tolerant software systems.
منابع مشابه
بررسی اثر جهات جغرافیایی و فاصله از قشر نمکی پلایا بر ترکیب و تنوع گونهای (مطالعه موردی: پلایای سیرجان)
It has been paid less attention to effect of environmental factors on species richness and diversity indices in fragile ecosystems around Playa. Therefore this study was conducted to evaluate the effect of geographical directions and distance from Playa salt layer on the composition and species diversity in Sirjan Playa, Kerman Province, Iran. Determination of intervals 10, 1000 and 2000 mete...
متن کاملFeasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms
We consider the problem of finding the localization of radioactive source by using data from a digital camera. In other words, the camera could help us to detect the direction of radioactive rays radiation. Therefore, the outcome could be used to command a robot to move toward the true direction to achieve the source. The process of camera data is performed by using image processing and computa...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملA Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملA Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
Greedy best-first search (GBFS) is a popular and effective algorithm in satisficing planning and is incorporated into high-performance planners. GBFS in planning decides its search direction with automatically generated heuristic functions. However, if the heuristic functions evaluate nodes inaccurately, GBFS may be misled into a valueless search direction, thus resulting in performance degrada...
متن کامل